A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS
نویسندگان
چکیده
منابع مشابه
A bracket polynomial for graphs. III. Vertex weights
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily modified to handle graphs with weighted vertices. We present formulas that simplify the computation of this weighted bracket for graphs that contain twin ve...
متن کاملA bracket polynomial for graphs
A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the Kauffman bracket to an invariant of looped graphs, and an extension of Reidemeister equivalence to an equivalence relation on looped graphs. The graph bracke...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملA bracket polynomial for graphs. II. Links, Euler circuits and marked graphs
Let D be an oriented classical or virtual link diagram with directed universe ~ U . Let C denote a set of directed Euler circuits, one in each connected component of U . There is then an associated looped interlacement graph L(D,C) whose construction involves very little geometric information about the way D is drawn in the plane; consequently L(D,C) is different from other combinatorial struct...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 2011
ISSN: 0218-2165,1793-6527
DOI: 10.1142/s0218216511008875